Generalized concavity and duality in continuous programming

Subgradient Optimization, Generalized Programming, and Nonconvex Duality

Duality in generalized linear fractional programming

This is a generalization of a fractional programming problem (p = 1) which has been investigated quite actively in the last two decades [21 ]. In [20] many of the results in fractional programming are reviewed and extended. An extensive bibliography is given in [22]. An early application of generalized fractional programming (p > 1) is von Neumann's model of an expanding economy [25]. Here the ...

Generalized Invexity and Duality in Multiobjective Programming Problems

In this paper we consider a multiobjective optimization problem, and we prove Mond-Weir duality results under second-and higher-order conditions of the objective and constraint functions.

Sufficiency and Duality of Fractional Integral Programming with Generalized Invexity

Convexity assumptions for fractional programming of variational type are relaxed to generalized invexity. The sufficient optimality conditions are employed to construct a mixed dual programming problem. It will involve the Wolfe type dual and Mond-Weir type dual as its special situations. Several duality theorems concerning weak, strong, and strict converse duality under the framework in mixed ...

Generalized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming

and Applied Analysis 3 It can be easily seen that for a compact convex set C, y is in NC x if and only if S y | C xy, or equivalently, x is in ∂S y | C . Definition 2.2. A functional F : X × X × R → R where X ⊆ R is sublinear with respect to the third variable if for all x, u ∈ X ×X, i F x, u; a1 a2 ≤ F x, u; a1 F x, u; a2 for all a1, a2 ∈ R, ii F x, u;αa αF x, u; a , for all α ∈ R and for all ...